Range-chart-guided iterative data-flow graph scheduling

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum-throughput Scheduling with Limited Resources for Iterative Data-flow Graphs by Means of the Scheduling-range Chart

This paper describes a technique for obtaining maximumthroughput schedules for iterative data-flow graphs, given a limited set of resources. The method is based on the use of the scheduling-range chart, where the scheduling window of each operation is displayed. This scheduling window, or scheduling range, is relative to a reference operation, and can be finite or infinite. The information in t...

متن کامل

List Scheduling for Iterative Data-flow Graphs

List Scheduling for Iterative Data-Flow Graphs Martin S. Koster and Sabih H. Gerez University of Twente, Department of Electrical Engineering P.O. Box 217, 7500 AE Enschede, The Netherlands e-mail: [email protected] or [email protected] Abstract This paper presents a scheduling method for the high-level synthesis of DSP algorithms described by iterative data ow graphs with an iterati...

متن کامل

Iterative Data-flow Analysis, Revisited

The iterative algorithm is widely used to solve instances of data-flow analysis problems. The algorithm is attractive because it is easy to implement and robust in its behavior. The theory behind the algorithm shows that, for a broad class of problems, it terminates and produces correct results. The theory also establishes a set of conditions where the algorithm runs in at most d(G) + 3 passes ...

متن کامل

Dependence Graph and Signal Flow Graph Scheduling ofPipelined

In this report, we illustrate the lookahead transformation in both the dependence graph and the signal ow graph domains. Various scheduling approaches for ne-grain pipelined adaptive QR algorithm are proposed, including pipelining, block processing, and incremental block processing. Among them, the incremental block processing ooers the least amount of hardware complexity which is linear increa...

متن کامل

Iterative Structure Discovery in Graph-Based Data

Much of current data mining research is focused on discovering sets of attributes that discriminate data entities into classes, such as shopping trends for a particular demographic group. In contrast, we are working to develop data mining techniques to discover patterns consisting of complex relationships between entities. Our research is particularly applicable to domains in which the data is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

سال: 1992

ISSN: 1057-7122

DOI: 10.1109/81.139286